an efficient genetic algorithm for a vehicle routing problem considering the competency of working teams

Authors

مرتضی کیانی

کارشناس ارشد مهندسی صنایع دانشگاه علوم و فنون مازندران هانی صیدگر

کارشناس ارشد مهندسی صنایع دانشگاه علوم و فنون مازندران ایرج مهدوی

استاد دانشکدة مهندسی صنایع دانشگاه علوم و فنون مازندران رضا توکلی مقدم

استاد دانشکدة مهندسی صنایع و مرکز پژوهشی بهینهسازی، پردیس دانشکدههای فنی دانشگاه تهران

abstract

this paper presents a new mathematical model for a combined manpower vehicle routing problem, in which working teams are considered as servers. having teams with different competency affects the service duration and cost that expands the flexibility of scheduling. a fleet of vehicles with different speed and cost of movement is used to transport these teams to visit the customers before the due date. the goal is to find an efficient schedule for the teams and vehicles movement to serve all the customers in order to minimize the total cost of serving, routing and lateness penalties. a mixed-integer programming model is presented and a number of tests problems are generated. to solve the large-sized problems, two meta-heuristics approaches, namely genetic algorithm (ga) and particle swarm optimization (pso) are developed, and then the taguchi experimental design method is applied to set the proper values of the parameters. the obtained results show the higher performance of the proposed ga compared with pso in terms of solutions quality within comparatively shorter periods of time.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm

Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of deman...

full text

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

full text

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

full text

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...

full text

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023